Dempster's Rule of Combination is #P-Complete
نویسنده
چکیده
We consider the complexity of combining bodies of evidence according to the rules of the Dempster{Shafer theory of evidence. We prove that, given as input a set of tables representing basic probability assignments m1; : : : ; mn over a frame of discernment , and a set A , the problem of computing the combined basic probability value (m1: : :mn)(A) is #P-complete. As a corollary, we obtain that while the simple belief, plau-sibility, and commonality values Bel(A), Pl(A), and Q(A) can be computed in polynomial time, the problems of computing the combinations
منابع مشابه
The Combination of Di erent Pieces of Evidence Using Incidence
Combining multiple sources of informationis a major and diicult task in the management of uncertainty. Dempster's combination rule is one of the attractive approaches. However, many researchers have pointed out that the application domains of the rule are rather limited and it sometimes gives unexpected results. In this paper, we have further explored the nature of combination and achieved the ...
متن کاملRule for U p d a t i n g Evidence
Abstrac t . In probabilistic reasoning when we have to build a probability distribution on some events and no further information is available, we then apply the insufficient reasoning principle; i.e. we assume that the events have equal opportunities to occur. In our previous work we have observed that in the Dempster-Shafer theory of evidence the principle is not applied when using Dempster's...
متن کاملSensitivity of Combination Schemes under Conflicting Conditions and a New Method
In the theory of evidential reasoning, Dempster's rule is used for combining belief functions based on independent evidences. There has been a lot of debate over the counter-intuitive nature of results obtained by this rule [4, 8, 14, 15]. Dubois and Prade [1, 3] have shown that Dempster's rule is not robust and is sensitive to inaccurate estimates of uncertainty values. Many authors have sugge...
متن کاملA model for non-monotonic reasoning using Dempster's rule
Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a probabilistic sense. More recently an e-calculus formulation of default reasoning (J. Pearl) shows that the application of Dempster's rule to a non-monotonic situation...
متن کاملThe Cumulative Rule for Belief Fusion
The problem of combining beliefs in the Dempster-Shafer belief theory has attracted considerable attention over the last two decades. The classical Dempster's Rule has often been criticised, and many alternative rules for belief combination have been proposed in the literature. The consensus operator for combining beliefs has nice properties and produces more intuitive results than Dempster's r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 44 شماره
صفحات -
تاریخ انتشار 1990